<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
</head>
<body>
    
</body>
</html>
<script>
//     题目1: 对字符串进行排列组合, 得到所有字符的全排列组合(假设所有字符不重复)
// 函数名：permutation
// 参数：需要排列组合的字符串
// 返回值：字符串的所有排列组合数组
// 例如：permutation("abc") 返回 ["abc", "acb", "bac", "bca", "cab", "cba"]

var permutation = function(s) {
    const res = new Set()
    const visit = {}
    function dfs(path) {
        if(path.length === s.length) return res.add(path)
        for (let i = 0; i < s.length; i++) {
            if (visit[i]) continue
            visit[i] = true
            dfs(path + s[i])
            visit[i] = false
        }
    }
    dfs('')
    return [...res]
};



console.log(permutation("abc"));

</script>